Gamma distribution

Gamma
Probability density function
Probability density plots of gamma distributions
Cumulative distribution function
Cumulative distribution plots of gamma distributions
parameters: k > 0\, shape
\theta > 0\, scale
support: x \in [0, \infty)\!
pdf: x^{k-1} \frac{\exp{\left(-x/\theta\right)}}{\Gamma(k)\,\theta^k}\,\!
cdf: \frac{\gamma(k, x/\theta)}{\Gamma(k)} \!
mean: k\theta \!
median: no simple closed form
mode: (k-1) \theta\text{ for }k \geq 1\,\!
variance: k \theta^2\,\!
skewness: \frac{2}{\sqrt{k}}\,\!
ex.kurtosis: \frac{6}{k}\,\!
entropy: k + \ln\theta + \ln\Gamma(k) \!
+ (1-k)\psi(k) \!
mgf: (1 - \theta\,t)^{-k}\text{ for }t < 1/\theta\,\!
cf: (1 - \theta\,i\,t)^{-k}\,\!

In probability theory and statistics, the gamma distribution is a two-parameter family of continuous probability distributions. It has a scale parameter θ and a shape parameter k. If k is an integer then the distribution represents the sum of k independent exponentially distributed random variables, each of which has a mean of θ (which is equivalent to a rate parameter of θ −1) .

The gamma distribution is frequently a probability model for waiting times; for instance, in life testing, the waiting time until death is a random variable that is frequently modeled with a gamma distribution.[1] Gamma distributions were fitted to rainfall amounts from different storms, and differences in amounts from seeded and unseeded storms were reflected in differences in estimated k and \theta parameters [2]

Contents

Characterization

A random variable X that is gamma-distributed with scale θ and shape k is denoted

X \sim \Gamma(k, \theta)\text{ or }X \sim \textrm{Gamma}(k,\theta ). \,

Probability density function

The probability density function of the gamma distribution can be expressed in terms of the gamma function parameterized in terms of a shape parameter k and scale parameter θ. Both k and θ will be positive values.

The equation defining the probability density function of a gamma-distributed random variable x is

 f(x;k,\theta) = x^{k-1} \frac{e^{-x/\theta}}{\theta^k \, \Gamma(k)}\text{ for } x \geq 0\text{ and }k, \theta > 0.\,

(This parameterization is used in the infobox and the plots.)

Alternatively, the gamma distribution can be parameterized in terms of a shape parameter α = k and an inverse scale parameter β = 1/θ, called a rate parameter:

g(x;\alpha,\beta) = \frac{\beta^{\alpha}}{\Gamma(\alpha)} x^{\alpha-1} e^{-\beta {x}} \text{ for }x \geq 0. \,

If α is a positive integer, then

 \Gamma(\alpha) = (\alpha - 1)!.\,

Both parametrizations are common because either can be more convenient depending on the situation.

Illustration of the Gamma PDF for parameter values over k and x with θ set to 1, 2, 3, 4, 5 and 6. One can see each θ layer by itself here [1] as well as by k [2] and x. [3].

Cumulative distribution function

The cumulative distribution function is the regularized gamma function:

 F(x;k,\theta) = \int_0^x f(u;k,\theta)\,du  
  =\frac{\gamma(k, x/\theta)}{\Gamma(k)} \,

where \gamma(k, x/\theta) is the lower incomplete gamma function.

It can also be expressed as follows, if k is a positive integer (i.e., the distribution is an Erlang distribution)[3]:

F(x;k,\theta) = 1-\sum_{i=0}^{k-1} \frac{(x/\theta)^i}{i!} e^{-x/\theta}.

Properties

Summation

If Xi has a Γ(ki, θ) distribution for i = 1, 2, ..., N, then


\sum_{i=1}^N X_i
\sim
\mathrm{Gamma}  \left( \sum_{i=1}^N k_i, \theta \right) \,\!

provided all Xi' are independent.

The gamma distribution exhibits infinite divisibility.

Scaling

If

X\,\sim\,\mathrm{Gamma}(k,\theta)

then for any α > 0,

\alpha X\,\sim\,\mathrm{Gamma}(k,\alpha\theta).

Exponential family

The Gamma distribution is a two-parameter exponential family with natural parameters k − 1 and −1/θ, and natural statistics X and ln (X).

Information entropy

The information entropy is given by


\begin{align}
& {}\qquad\frac{-1}{\theta^k \Gamma(k)} \int_0^\infty \frac{x^{k-1}}{e^{x/\theta}} \left[ (k-1)\ln x - x/\theta - k \ln\theta - \ln\Gamma(k) \right] \,dx \\[8pt]
& = -\left[ (k-1) (\ln\theta + \psi(k)) - k - k \ln\theta - \ln\Gamma(k) \right] \\[8pt]
& = k + \ln\theta + \ln\Gamma(k) + (1-k)\psi(k)
\end{align}

where ψ(k) is the digamma function.

One can also show that (if we use the shape parameter k and the inverse scale parameter β),

\mathbb{E}[\ln(x)] = \psi(k) - \ln(\beta). \,

Or alternately, using the scale parameter θ,

\mathbb{E}[\ln(x)] = \psi(k) + \ln(\theta). \,
Illustration of the Kullback–Leibler (KL) divergence for two Gamma PDF's. Here β = β0 + 1 which are set to 1, 2, 3, 4, 5 and 6. The typical asymmetry for the KL divergence is clearly visible.

Kullback–Leibler divergence

The directed Kullback–Leibler divergence between Γ(θ0, β0) ('true' distribution) and Γ(θ, β) ('approximating' distribution), for shape parameter θ and inverse scale parameter β is given by


D_{\mathrm{KL}}(\theta_0,\beta_0 || \theta, \beta) = \log\left(\frac{\Gamma({\theta})\beta_0^{\theta_0}}{\Gamma(\theta_0)\beta^{\theta}}\right)+(\theta_0-\theta)(\psi(\theta_0)-\log \beta_0)+\theta_0\frac{\beta-\beta_0}{\beta_0}

Laplace transform

The Laplace transform of the gamma PDF is


F(s)=\left(1+\theta s\right)^{-k}=\frac{\beta^\alpha}{(s+\beta)^\alpha}.

Parameter estimation

Maximum likelihood estimation

The likelihood function for N iid observations (x1, ..., xN) is

L(k,\theta)=\prod_{i=1}^N f(x_i;k,\theta)\,\!

from which we calculate the log-likelihood function

\ell(k,\theta) = (k-1) \sum_{i=1}^N \ln{(x_i)} - \sum_{i=1}^N x_i/\theta - Nk\ln{(\theta)} - N\ln{\Gamma(k)}.

Finding the maximum with respect to θ by taking the derivative and setting it equal to zero yields the maximum likelihood estimator of the θ parameter:

\hat{\theta} = \frac{1}{kN}\sum_{i=1}^N x_i. \,\!

Substituting this into the log-likelihood function gives

\ell=(k-1)\sum_{i=1}^N\ln{(x_i)}-Nk-Nk\ln{\left(\frac{\sum x_i}{kN}\right)}-N\ln{(\Gamma(k))}. \,\!

Finding the maximum with respect to k by taking the derivative and setting it equal to zero yields

\ln{(k)}-\psi(k)=\ln{\left(\frac{1}{N}\sum_{i=1}^N x_i\right)}-\frac{1}{N}\sum_{i=1}^N\ln{(x_i)} \,\!

where

\psi(k) = \frac{\Gamma'(k)}{\Gamma(k)} \!

is the digamma function.

There is no closed-form solution for k. The function is numerically very well behaved, so if a numerical solution is desired, it can be found using, for example, Newton's method. An initial value of k can be found either using the method of moments, or using the approximation

\ln(k)-\psi(k) \approx \frac{1}{k}\left(\frac{1}{2} + \frac{1}{12k+2}\right). \,\!

If we let

s = \ln{\left(\frac{1}{N}\sum_{i=1}^N x_i\right)} - \frac{1}{N}\sum_{i=1}^N\ln{(x_i)},\,\!

then k is approximately

k \approx \frac{3-s+\sqrt{(s-3)^2 + 24s}}{12s}

which is within 1.5% of the correct value. An explicit form for the Newton-Raphson update of this initial guess is given by Choi and Wette (1969) as the following expression:

k \leftarrow k - \frac{ \ln k - \psi\left(k\right) - s }{ 1/k - \psi\;'\left(k\right) }

where \psi\;'\left(\cdot\right) denotes the trigamma function (the derivative of the digamma function).

The digamma and trigamma functions can be difficult to calculate with high precision. However, approximations known to be good to several significant figures can be computed using the following approximation formulae:


\psi\left(k\right) = \begin{cases}
\ln(k) - ( 1 + ( 1 - ( 1/10 - 1 / ( 21 k^2 ) ) / k^2 ) / ( 6 k ) ) / ( 2 k ), \quad k \geq 8 \\
\psi\left( k + 1 \right) - 1/k, \quad k < 8
\end{cases}

and


\psi\;'\left(k\right) = \begin{cases}
( 1 + ( 1 + ( 1 - ( 1/5 - 1 / ( 7 k^2 ) ) / k^2 ) / ( 3 k ) ) / ( 2 k ) ) / k, \quad k \geq 8, \\
\psi\;'\left( k + 1 \right) + 1/k^2, \quad k < 8.
\end{cases}

For details, see Choi and Wette (1969).

Bayesian minimum mean-squared error

With known k and unknown  \theta , the posterior PDF for theta (using the standard scale-invariant prior for \theta) is


P(\theta | k, x_1, ..., x_N) \propto 1/\theta \prod_{i=1}^N f(x_i;k,\theta).\,\!

Denoting

 y \equiv \sum_{i=1}^N x_i , \qquad  P(\theta | k, x_1, \dots , x_N) = C(x_i)  \theta^{-N k-1} e^{-y / \theta}. \!

Integration over θ can be carried out using a change of variables, revealing that 1/θ is gamma-distributed with parameters \scriptstyle \alpha = N k,\ \  \beta = y.


\int_0^{\infty} \theta^{-N k-1+m} e^{-y / \theta}\, d\theta = \int_0^{\infty} x^{N k -1 -m} e^{-x y} \, dx = y^{-(N k -m)} \Gamma(N k -m). \!

The moments can be computed by taking the ratio (m by m = 0)


E(x^m) = \frac {\Gamma (N k -m)} {\Gamma(N k)} y^m, \!

which shows that the mean ± standard deviation estimate of the posterior distribution for theta is

 \frac {y} {N k -1} \pm \frac {y^2} {(N k-1)^2 (N k-2)}.

Generating gamma-distributed random variables

Given the scaling property above, it is enough to generate gamma variables with \theta = 1 as we can later convert to any value of \beta with simple division.

Using the fact that a \Gamma(1,1) distribution is the same as an Exp(1) distribution, and noting the method of generating exponential variables, we conclude that if U is uniformly distributed on (0,1], then −\ln(U) is distributed \Gamma(1,1). Now, using the "α-addition" property of gamma distribution, we expand this result:

\sum_{k=1}^n {-\ln U_k} \sim \Gamma(n, 1),

where U_k are all uniformly distributed on (0,1] and independent.

All that is left now is to generate a variable distributed as \Gamma(\delta,1) for 0 < \delta < 1 and apply the "α-addition" property once more. This is the most difficult part.

We provide an algorithm without proof. It is an instance of the acceptance-rejection method:

  1. Let m be 1.
  2. Generate V_{3m - 2}, V_{3m - 1} and V_{3m} as independent uniformly distributed on (0,1] variables.
  3. If V_{3m - 2} \le v_0, where v_0 = \frac e {e + \delta}, then go to step 4, else go to step 5.
  4. Let \xi_m = V_{3m - 1}^{1 / \delta}, \ \eta_m = V_{3m} \xi _m^ {\delta - 1}. Go to step 6.
  5. Let \xi_m = 1 - \ln {V_{3m - 1}}, \ \eta_m = V_{3m} e^{-\xi_m}.
  6. If \eta_m > \xi_m^{\delta - 1} e^{-\xi_m}, then increment m and go to step 2.
  7. Assume \xi = \xi_m to be the realization of \Gamma  (\delta, 1)

Now, to summarize,

 \theta \left( \xi - \sum _{i=1} ^{\lfloor{k}\rfloor} {\ln U_i} \right) \sim \Gamma (k, \theta),

where \lfloor{k}\rfloor is the integral part of k, and \xi has been generated using the algorithm above with \delta = \{k\} (the fractional part of k), U_k and V_l are distributed as explained above and are all independent.

Related distributions

Specializations

Conjugate prior

In Bayesian inference, the gamma distribution is the conjugate prior to many likelihood distributions: the Poisson, exponential, normal (with known mean), Pareto, gamma with known shape σ, and inverse gamma with known shape parameter.

The Gamma distribution's conjugate prior is [4]:

p(k,\theta | p,q,r,s) = \frac{1}{Z} \frac{p^{k-1} e^{-\theta^{-1} q}}{\Gamma(k)^r \theta^{k s}}

Where Z is the normalizing constant, which has no closed form solution. The posterior distribution can be found by updating the parameters as follows.

p' = p\prod_i x_i q' = q + \sum_i x_i r' = r + n,s' = s + n

Where n is the number of observations, and x_i is the i^{th} observation.

Others

Applications

The gamma distribution has been used to model the size of insurance claims and rainfalls. This means aggregate insurance claims and the amount of rainfall accumulated in a reservoir are modelled by a gamma process.

See also

Notes

  1. See Hogg and Craig Remark 3.3.1. for an explicit motivation.test
  2. Rice, John (1995), Mathematical Statistics and Data Analysis (Second ed.), Duxbury Press, p. 244, ISBN 0-534-20934-3 
  3. Papoulis, Pillai, Probability, Random Variables, and Stochastic Processes, Fourth Edition
  4. Fink, D. 1995 A Compendium of Conjugate Priors. In progress report: Extension and enhancement of methods for setting data quality objectives. (DOE contract 95‑831).

References